Location:
Search - memory search
Search list
Description: 通过记忆花搜索实现人机对话，并使电脑具有学习功能(Through the memory flower search to achieve human-computer dialogue, and make the computer has learning function)
Platform: |
Size: 98304 |
Author: geng628
|
Hits:
Description: 编写C++程序完成以下功能： 实现简单电话本功能，用姓名来搜索电话号码； 用户输入姓名，程序查找并输出结果； 用户可以通过输入，添加姓名和电话号码； 用户可以删除姓名和电话号码； 电话本可以保存在指定文件中； 电话可被从指定文件中读入到内存。(Write a C++ program to complete the following functions: simple phone book function, use the name to search for phone numbers; the user name, the program to find and output; users can input, add your name and telephone number; the user can delete your name and telephone number; the telephone can be saved in the specified file; the telephone can be from the specified file read into memory.)
Platform: |
Size: 2048 |
Author: Altria
|
Hits:
Description: 源码之前了无秘密，你将看到vector的实现、list的实现、heap的实现、deque的实现、Red Black tree的实现、hash table的实现、set/map的实现;你将看到各种算法(排序、查找、排列组合、数据移动与复制技术)的实现;你甚至能够看到底层的memory pook和高阶抽象的traits机制的实现。(Before the secret source code, you will see the vector implementation, list implementation, heap implementation, deque implementation, Red Black tree, hash table, to achieve the realization of set/map; you will see a variety of algorithms (search, sorting, permutation and combination, and mobile data replication technology) to achieve even you; to see the realization of the underlying memory pook and higher order abstract traits mechanism.)
Platform: |
Size: 226304 |
Author: qwer@
|
Hits:
Description: 二分查找又称折半查找，优点是比较次数少，查找速度快，平均性能好，占用系统内存较少；其缺点是要求待查表为有序表，且插入删除困难。因此，折半查找方法适用于不经常变动而查找频繁的有序列表。首先，假设表中元素是按升序排列，将表中间位置记录的关键字与查找关键字比较，如果两者相等，则查找成功；否则利用中间位置记录将表分成前、后两个子表，如果中间位置记录的关键字大于查找关键字，则进一步查找前一子表，否则进一步查找后一子表。重复以上过程，直到找到满足条件的记录，使查找成功，或直到子表不存在为止，此时查找不成功。(Two search and binary search, the utility model has the advantages of low frequency, average speed, good performance, the system memory is less; the disadvantage is the requirement for 0.9 ordered list, and insert delete difficult. Therefore, the binary search method for an ordered list to find frequent and often change. First of all, the periodic table is assumed in ascending order, compared with the keyword search keywords will form the middle position of the record, if the two are equal, find success; otherwise the middle position recorded before and after the table is divided into two sub tables, if the middle position recorded in a keyword search keywords, before further lookup sub table otherwise, after a further search of the child table. Repeat the above process until the lookup is successful, or until the subtable does not exist, and the lookup is not successful.)
Platform: |
Size: 12288 |
Author: 张三儿丰
|
Hits:
Description: /* 自定义LinkList单链表类型 */
/*函数，用尾插入法建立带头结点的单链表*/
/*函数，用头插入法建立带头结点的单链表 */
/*函数，按值查找结点 */
/*函数，删除指定值的结点 */
/*函数，打印链表中的所有值*/
/*函数，删除所有结点，释放内存 */
/*修改程序：增加节点。用头插法，返回头指针*/(Custom LinkList single chain type / * * /
* / function, establish a lead single node list * tail insertion
* / function, establish a lead single node list * head insert
* / function, according to the value of search node.
* / function, delete the specified value of the node.
* / function, all the values in the list * / print
* / function, delete all nodes, release the memory.
Should modify the program: add nodes. With the first interpolation method, return the head pointer.)
Platform: |
Size: 1024 |
Author: wuthering。
|
Hits:
Description: 话说这个源码挺好的，能在线搜素电视剧，之后双击结果就能播放，采用定位，无论窗口如何缩放，其他组件都会配合，这比起官方播放器，内存占用极少，无需登陆就能观看，使用正则匹配出来的效果，以HTTP读取方式得到搜索源头，再通过编码转换，最后取出地址和名称，最后使用循环批量得到，将播放器置入到超文本浏览框中，就可以播放了，具体看源码哈！(As a very good source, can search online TV, double-click on the positioning result can play, regardless of how the window is to zoom, other components will cooperate with the player than the official, the memory footprint is few, without landing can watch, using regular expressions to effect, to read HTTP way to get the search source. By encoding conversion, and finally remove the name and address, finally use the batch cycle, the player into hypertext browsing box, you can play, look at the specific source!)
Platform: |
Size: 37888 |
Author: 123456lk
|
Hits:
Description: Process Explorer is an advanced process management utility that picks up where Task Manager leaves off. It will show you detailed information about a process including its icon, command-line, full image path, memory statistics, user account, security attributes, and more. When you zoom in on a particular process you can list the DLLs it has loaded or the operating system resource handles it has open. A search capability enables you to track down a process that has a resource opened, such as a file, directory or Registry key, or to view the list of processes that have a DLL loaded.
Platform: |
Size: 884736 |
Author: d3nz1g |
Hits:
Description: 方便辅助制作，快速查找游戏内存...制作游戏辅助好帮手，喜欢的下载吧~！(Easy to assist production, quick search of game memory, making games, assisting good helpers, like download.)
Platform: |
Size: 734208 |
Author: qiangqiang111 |
Hits:
Description: 本设计以MCU为控制核心,使用迷宫算法与机器自主学习的思想核心和电机PID调速为运动核心的一款智能迷宫小车，通过对传感器的加权平均处理进行高精度数据采集，将连续性变量转换成离散随机变量。首先根据左手运算进行迷宫整体搜索，然后进行数组记忆和最优路径运算，第二次进入赛道5秒逃出迷宫。(This design takes the MCU as the control core, uses the maze algorithm and the machine independent learning core and the motor PID speed control as the core of an intelligent labyrinth car. Through the weighted average processing of the sensor, high precision data acquisition is carried out, and the continuous variables are converted into discrete random variables. First, the maze search is done based on the left hand operation, and then the array memory and the optimal path operation are used to escape the maze second times into the circuit 5 seconds.)
Platform: |
Size: 1883136 |
Author: 那就是 |
Hits:
Description: 内存修改,选择进程,可以修改和编辑内存数据等!!!
可以选择搜索内存的地址.(Memory modification, selection process, can modify and edit memory data and so on!!!
You can choose the address of the search memory.)
Platform: |
Size: 147456 |
Author: letto |
Hits:
Description: 针对面临的问题寻找优化解是人类的思维习惯和行为方式。借鉴人类丰富的社会经验，模拟人类搜索活动的智能行为，提出了一种新的基于种群的启发式随机搜索算法，即人群搜索算法 SOA（seeker optimization Algorithm）。SOA 研究人类在随机搜索时所采用的交流、协作、记忆、推理、学习知识与经验等的智能行为，结合搜索和进化思想，以搜寻队伍为种群，以搜寻者位置为优化问题的候选解，通过模拟人类搜索的“经验梯度”和不确定性推理，分别确定搜索方向和步长，完成位置更新，实现对所求问题解的优化(It is human's habit of thinking and behavior to find the optimal solution to the problems. Based on the rich social experience of human beings and simulating the intelligent behavior of human search activities, a new population-based heuristic random search algorithm, Seeker Optimization algorithm, is proposed. SOA This paper studies the intelligent behaviors of communication, cooperation, memory, reasoning, learning knowledge and experience used by human beings in random search, combines the ideas of search and evolution, takes the search team as the population, takes the location of the searcher as the candidate solution of the optimization problem, determines the search direction and step length respectively by simulating the "experience gradient" and uncertainty reasoning of human search, and completes the location update To optimize the solution of the problem)
Platform: |
Size: 13312 |
Author: Fantasy1017 |
Hits:
«
1
2
...
16
17
18
19
20
21»